On LT Codes with Decreasing Ripple Size

نویسندگان

  • Jesper H. Sørensen
  • Petar Popovski
  • Jan Østergaard
چکیده

In the orignal work on LT codes by Luby, the ripple size during decoding was designed to be approximately constant. In fact, the Ideal Soliton and the Robust Soliton distributions were designed to yield an approximately unit ripple size and a fixed ripple size greater than one, respectively. In this work, the redundancy within an LT code is characterized, and it is found that a decreasing ripple size during decoding is beneficial. Furthermore, a new design of LT codes with decreasig ripple size is proposed, and it is shown that this design significantly decreases the average amount of redundancy in comparison to existing designs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of improved Luby transform codes with decreasing ripple size and feedback

In this study, the design of improved Luby transform codes with decreasing ripple size (LTC-DRS) with feedback is presented. Under the proposed design, a new degree distribution algorithm named generalised degree distribution algorithm (GDDA) is proposed, which can achieve arbitrary ripple size revolution accurately. On the basis of GDDA, an accurate ripple size revolution based on binomial fit...

متن کامل

Graph-based Codes and Generalized Product Constructions

Fountain codes are a class of rateless codes well-suited for communication over erasure channels with unknown erasure parameter. We analyze the decoding of LT codes, the first instance of practical, universal Fountain codes. A set of interest during LT decoding is the set of output symbols of reduced degree one (the “ripple”). The evolution of the ripple size throughout the decoding process is ...

متن کامل

Erasure Codes with a Hierarchical Bundle Structure

This paper presents a proof of the existence of computationally fast probabilistic erasure codes at distance ǫ from being MDS, namely the decoding algorithm is able with high probability to reconstruct the n letter message from any set of (1+ǫ)n letters. It can either be fixed rate or a rateless LT code [10] in that any number of code letters can be produced and each is produced independently o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011